Faithful polygonal representation of the convex and concave parts of a digital curve
نویسندگان
چکیده
From results about digital convexity, we define a reversible polygon that faithfully represents the maximal convex and concave parts of a digital curve. Such a polygon always exists and is unique in the general case. It is computed from a given digital curve in linear-time using well-known routines: adding a point at the front of a digital straight segment and removing a point from the back of a digital straight segment. It may helps to extract perceptually meaningful parts of shape outlines or lines.
منابع مشابه
What Does Digital Straightness Tell about Digital Convexity?
The paper studies local convexity properties of parts of digital boundaries. An online and linear-time algorithm is introduced for the decomposition of a digital boundary into convex and concave parts. In addition, other data are computed in the same time without any extra cost: the hull of each convex or concave part as well as the Bezout points of each edge of those hulls. The proposed algori...
متن کاملLocal convexity properties of digital curves
The paper studies local convexity properties of digital curves. We locally define convex and concave parts from the slope of maximal digital straight segments and arithmetically characterize the smallest digital pattern required for checking convexity. Moreover, we introduce the concepts of digital edge and digital hull, a digital hull being a sequence of increasing or decreasing digital edges....
متن کاملAnalysis and Comparative Evaluation of Discrete Tangent Estimators
This paper presents a comparative evaluation of tangent estimators based on digital line recognition on digital curves. The comparison is carried out with a comprehensive set of criteria: accuracy on smooth or polygonal shapes, behaviour on convex/concave parts, computation time, isotropy, aymptotic convergence. We further propose a new estimator mixing the qualities of existing ones and outper...
متن کاملCharacterizations of $L$-convex spaces
In this paper, the concepts of $L$-concave structures, concave $L$-interior operators and concave $L$-neighborhood systems are introduced. It is shown that the category of $L$-concave spaces and the category of concave $L$-interior spaces are isomorphic, and they are both isomorphic to the category of concave $L$-neighborhood systems whenever $L$ is a completely distributive lattice. Also, it i...
متن کاملHamburger Beitrage zur Angewandten Mathematik Polygonal Representations of Digital Sets
In the context of discrete curve evolution the following problem is of relevance: Decompose the boundary of a plane digital object into convex and concave parts. Such a decomposition is very useful for describing the form of an object e.g. for shape databases. Although the problem is relatively trivial in ordinary plane geometry, in digital geometry its statement becomes a very diÆcult task due...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition
دوره 44 شماره
صفحات -
تاریخ انتشار 2011